Compactness Properties for Stable Semantics of Logic Programs
نویسندگان
چکیده
Logic programming with stable logic semantics (SLP) is a logical formalism that assigns to sets of clauses in the language admitting negations in the bodies a special kind of models, called stable models. This formalism does not have the compactness property. We show a number of conditions that entail a form of compactness for SLP.
منابع مشابه
On Finitely Recursive Programs
Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties, for example ground queries are decidable while in the general case the stable model semantics is Π11-hard. In this paper we prove that a larger class of programs, called finitely recursive programs, preserves most of the good properties...
متن کاملAn Abductive Framework for General Logic Programs and other Nonmonotonic Systems
We present an abductive semantics for general propositional logic programs which defines the meaning of a logic program in terms of its extensions. This approach extends the stable model semantics for normal logic programs in a natural way. The new semantics is equivalent to stable semantics for a logic program P whenever P is normal and has a stable model. The abductive semantics can also be a...
متن کاملStable Generated Models of Generalized Constraint Logic Programs
We present a declarative semantics of generalized constraint logic programs based on stable generated models. Generalized logic programs contain arbitrary quantiier free formulas in the bodies and heads of their rules. Up to now the only declarative semantics for this program class is deened in terms of stable generated models introduced by Herre and Wagner. A generalized constraint logic progr...
متن کاملPartial Stable Models for Logic Programs with Aggregates
We introduce a family of partial stable model semantics for logic programs with arbitrary aggregate relations. The semantics are parametrized by the interpretation of aggregate relations in three-valued logic. Any semantics in this family satisfies two important properties: (i) it extends the partial stable semantics for normal logic programs and (ii) total stable models are always minimal. We ...
متن کاملCharacterizations of stable model semantics for logic programs with arbitrary constraint atoms
This paper studies the stable model semantics of logic programs with (abstract) constraint atoms and their properties. We introduce a succinct abstract representation of these constraint atoms in which a constraint atom is represented compactly. We show two applications. First, under this representation of constraint atoms, we generalize the Gelfond-Lifschitz transformation and apply it to defi...
متن کامل